Generalization of ZYT-linearizability for bilinear datalog programs
نویسندگان
چکیده
We propose a new type of linearizability, called right-linear-first (RLF) linearizability. The well-known ZYTlinearizability deals with only one bilinear rule. RLF-linearizability is a generalization of ZYT-linearizability since RLF-linearizability deals with general bilinear datalog programs consisting of multiple bilinear and linear rules. We identify sufficient conditions for RLF-linearizability. The test of the sufficient conditions is exponential in the size of the input datalog program, which is, however, usually very small compared with the size of the extensional database in deductive database applications. © 2003 Elsevier Inc. All rights reserved.
منابع مشابه
Refinement of Datalog Programs
Refinement operators are exploited to change in an automated way incorrect clauses of a logic program. In this paper, we present four refinement operators for Datalog programs and demonstrate that all of them meet the properties of local finiteness, properness, and completeness (ideality). Such operators are based on the quasi-ordering induced upon a set of clauses by the generalization model o...
متن کاملTheory and Practice of Logic Programming
FS-rules provide a powerful monotonic extension for Horn clauses that supports monotonic aggregates in recursion by reasoning on the multiplicity of occurrences satisfying existential goals. The least fixpoint semantics, and its equivalent least model semantics, hold for logic programs with FS-rules; moreover, generalized notions of stratification and stable models are easily derived when negat...
متن کاملReconciling Active and Deductive Databases by States Institut F Ur Informatik | Report 70
We propose a state-oriented extension to Datalog called Statelog which comprises two kinds of rules, passive query rules and active transition rules within a simple, yet exible logical framework. Statelog programs have deterministic model-theoretic semantics for queries and updates thus reconciling active and deductive databases. Using the Statelog framework we prove that termination of active ...
متن کاملRobust Approximate Bilinear Programming Robust Approximate Bilinear Programming for Value Function Approximation
Existing value function approximation methods have been successfully used in many applications, but they often lack useful a priori error bounds. We propose a new approximate bilinear programming formulation of value function approximation, which employs global optimization. The formulation provides strong a priori guarantees on both robust and expected policy loss by minimizing specific norms ...
متن کاملMagic Sets and Their Application to Data Integration
We propose a generalization of the well-known Magic Sets technique to Datalog¬ programs with (possibly unstratified) negation under stable model semantics. Our technique produces a new program whose evaluation is generally more efficient (due to a smaller instantiation), while preserving soundness under cautious reasoning. Importantly, if the original program is consistent, then full query-equi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 188 شماره
صفحات -
تاریخ انتشار 2004